Search results for " decentralized"
showing 10 items of 10 documents
Density Flow in Dynamical Networks via Mean-Field Games
2016
Current distributed routing control algorithms for dynamic networks model networks using the time evolution of density at network edges, while the routing control algorithm ensures edge density to converge to a Wardrop equilibrium, which was characterized by an equal traffic density on all used paths. We rearrange the density model to recast the problem within the framework of mean-field games. In doing that, we illustrate an extended state-space solution approach and we study the stochastic case where the density evolution is driven by a Brownian motion. Further, we investigate the case where the density evolution is perturbed by a bounded adversarial disturbance. For both the stochastic a…
Game Theoretic Decentralized Feedback Controls in Markov Jump Processes
2017
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field games with large number of players. Building on a state-space extension technique, we turn the problem into an optimal control one for each single player. The main contribution is an explicit expression of the optimal decentralized control which guarantees the convergence both to local and to global equilibrium points. Furthermore, we study the stability of the system also in the presence of a delay which we model using an hysteresis operator. As a result of the hysteresis, we prove existence of multiple equilibrium points and analyze convergence conditions. The stability of the system is ill…
MR3090050 Reviewed Belabbas, Mohamed Ali On global stability of planar formations. IEEE Trans. Automat. Control 58 (2013), no. 8, 2148–2153. (Reviewe…
2014
The focus of the paper is planar formation control, i.e. the design of control laws to stabilize agents at given distances from each other, under the constraint that the dynamics of each agent only depends on a subset of the other agents. The main contribution of the paper is the following: It is shown that a simple four-agent formation cannot be globally stabilized using twice differentiable control laws (this is not the case for three-agent formations), even up to sets of measure zero of initial conditions. This suggests that for four-agent formations one needs to look for control laws that are either not differentiable (or even not continuous) or of higher order in the dynamics. The appr…
A decentralized solution for the constrained minimum cost flow
2010
In this paper we propose a decentralized solution to the problem of network stabilization, under flow constraints ensuring steady—state flow optimality. We propose a stabilizing strategy for network flow control with capacity constraints which drives the buffer levels arbitrarily close to a desired reference. This is a decentralized strategy optimizing the flow via the minimization of a quadratic cost of the control. A second problem characterized by non-fully connected networks is also considered, for which an exact network equilibrium is not possible. Here, the strategy, in the absence of constraints leads to a least square decentralized problem, but, unfortunately, in the presence of con…
A Survey on Privacy in Decentralized Online Social Networks
2018
Decentralized Online Social Networks (DOSNs) have recently captured the interest of users because of the more control given to them over their shared contents. Indeed, most of the user privacy issues related to the centralized Online Social Network (OSN) services (such as Facebook or Google+) do not apply in the case of DOSNs because of the absence of the centralized service provider. However, these new architectures have motivated researchers to investigate new privacy solutions that allow DOSN’s users to protect their contents by taking into account the decentralized nature of the DOSNs platform. In this survey, we provide a comprehensive overview of the privacy solutions adopted by…
Non-linear protocols for optimal distributed consensus in networks of dynamic agents
2006
We consider stationary consensus protocols for networks of dynamic agents with fixed topologies. At each time instant, each agent knows only its and its neighbors'' state, but must reach consensus on a group decision value that is function of all the agents'' initial state. We show that the agents can reach consensus if the value of such a function is time-invariant when computed over the agents'' state trajectories. We use this basic result to introduce a non-linear protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents'' initial states. As a second contribution we show that our protocol design is t…
Trajectory Decentralized Fuzzy Control of Multiple UAVs.
2008
This paper considers a complete position and heading rate control system for multiple unmanned aerial vehicles (UAVs) with constant altitude. A decentralized trajectory planning algorithm is proposed, where the UAVs will avoid collisions while moving. In order to stabilize the UAVs in the reference planned trajectories and ensure the boundedness of the control velocities, a fuzzy control law is proposed with Lyapunov's stability proof. Simulation experiments developed in Matlab environment confirm the effectiveness and the robustness of the proposed control algorithm with respect to possible turbulence disturbances perturbing the nominal motion of the UAVs.
Analysis of Users Behaviour from a Movie Preferences Perspective
2018
Despite their tremendous popularity, Online Social Networks (OSNs) have several issues related to the privacy of social users. These issues have motivated researchers to develop OSN services that take advantage of the decentralized platforms (such as P2P systems or opportunistic networks). Decentralized Online Social Networks (DOSNs) need specific approaches to manage the decentralization of social data. In particular, data availability is one of the main issues and current proposals exploit properties of the social relationships to manage it. At the best of our knowledge, there are no proposals which exploit similarity between users, expressed with the term homophily. Homophily has been we…
LPV model identification for gain scheduling control: An application to rotating stall and surge control problem
2006
Abstract We approach the problem of identifying a nonlinear plant by parameterizing its dynamics as a linear parameter varying (LPV) model. The system under consideration is the Moore–Greitzer model which captures surge and stall phenomena in compressors. The control task is formulated as a problem of output regulation at various set points (stable and unstable) of the system under inputs and states constraints. We assume that inputs, outputs and scheduling parameters are measurable. It is worth pointing out that the adopted technique allows for identification of an LPV model's coefficients without the requirements of slow variations amongst set points. An example of combined identification…
Predicting the availability of users' devices in Decentralized Online Social Networks
2018
The understanding of the user temporal behavior is a crucial aspect for all those systems that rely on user resources for daily operations, such as decentralized online social networks (DOSNs). Indeed, DOSNs exploit the devices of their users to take on and share the tasks needed to provide services such as storing the published data. In the last years, the increasing popularity of DOSN services has changed the way of how people interact with each other by enabling users to connect to these services at any time by using their personal devices (such as notebooks or smartphones). As a result, the availability of data in these systems is strongly affected (or reflected) by the temporal behavio…